Predicting Structure in Sparse Matrix Computations
نویسندگان
چکیده
منابع مشابه
Predicting Structure in Sparse Matrix Computations
Many sparse matrix algorithms|for example, solving a sparse system of linear equations|begin by predicting the nonzero structure of the output of a matrix computation from the nonzero structure of its input. This paper is a catalog of ways to predict nonzero structure. It contains known results for problems including various matrix factorizations, and new results for problems including some eig...
متن کاملVisualizing Sparse Matrix Computations
This paper describes ideas and tools that help with the visualization of sparse matrix computations. The paper uses the Sparse Matrix Manipulation System, an environment for handling sparse matrices of all types in a vy flexible manner via ASCII file interfaces. Two commands in this environment are ShowMalrix and ShowTree. The first illustrates the pattern of nonzeroes of a sparse matrix. The s...
متن کاملRescheduling for Locality in Sparse Matrix Computations
In modern computer architecture the use of memory hierarchies causes a program's data locality to directly aaect performance. Data locality occurs when a piece of data is still in a cache upon reuse. For dense matrix computations, loop transformations can be used to improve data locality. However, sparse matrix computations have non-aane loop bounds and indirect memory references which prohibit...
متن کاملSparse Matrix Computations Arising in Distributedparameter Identificationcurtis
A penalized least squares approach known as Tikhonov regularization is commonly used to estimate distributed parameters in partial diierential equations. The application of quasi-Newton minimization methods then yields very large linear systems. While these systems are not sparse, sparse matrices play an important role in gradient evaluation and Hessian matrix-vector multiplications. Motivated ...
متن کاملExploiting Locality on Parallel Sparse Matrix Computations
By now, irregular problems are di cult to parallelize in an automatic way because of their lack of regularity in data access patterns. Most times, programmers must hand-write a particular solution for each problem separately. In this paper we present two pseudo-regular distributions which can be applied to partition most problems achieving very good average case distributions. Also, we have des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1994
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479887139455